Bisimulations and behaviour of nondeterministic automata
نویسندگان
چکیده
The minimization of nondeterministic automata without initial states (developed within a game-theoretic framework in Calude, Calude, Khoussainov [3]) is presented in terms of bisimulations; the minimal automaton is unique up to an isomorphism in case of reversible automata. We also prove that there exists an infinite class of (strongly connected) nondeterministic automata each of which is not bisimilar with any deterministic automaton. This shows that in the sense of bisimilarity nondeterministic automata are more powerful than deterministic ones. It is an open question whether the method of bisimulations can produced, in general, the unique minimal nondeterministic automaton.
منابع مشابه
ar X iv : 1 10 2 . 54 49 v 1 [ cs . F L ] 2 6 Fe b 20 11 Nondeterministic automata : equivalence , bisimulations , and uniform relations ✩
In this paperwe study the equivalenceofnondeterministic automatapairing the conceptof abisimulationwith the recently introduced concept of a uniform relation. In this symbiosis, uniform relations serve as equivalence relations which relate states of two possibly different nondeterministic automata, and bisimulations ensure compatibility with the transitions, initial and terminal states of these...
متن کاملNondeterministic automata: equivalence, bisimulations, and uniform relations
In this paperwe study the equivalenceofnondeterministic automatapairing the conceptof abisimulationwith the recently introduced concept of a uniform relation. In this symbiosis, uniform relations serve as equivalence relations which relate states of two possibly different nondeterministic automata, and bisimulations ensure compatibility with the transitions, initial and terminal states of these...
متن کاملBisimulations for fuzzy automata
Bisimulations have beenwidely used inmany areas of computer science tomodel equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the st...
متن کاملForward Bisimulations for Nondeterministic Symbolic Finite Automata
Symbolic automata allow transitions to carry predicates over rich alphabet theories, such as linear arithmetic, and therefore extend classic automata to operate over infinite alphabets, such as the set of rational numbers. Existing automata algorithms rely on the alphabet being finite, and generalizing them to the symbolic setting is not a trivial task. In our earlier work, we proposed new tech...
متن کاملOn the Bisilimarity of the Position Automata
Minimization of nondeterministic finite automata (NFA) is a hard problem (PSPACEcomplete). Bisimulations are then an attractive alternative for reducing the size of NFAs, as even bisimilarity (the largest bisimulation) is almost linear using the Paige and Tarjan algorithm. NFAs obtained from regular expressions (REs) can have the number of states linear with respect to the size of the REs and c...
متن کامل